A New Approach to Intra-Sub-Cluster File Searching implemented in p2p File System

In internet p2p file sharing system generates more traffic. To get better file query performance cluster the common interested peers based on physical proximity. In this project proposing a proximity aware interest –clustered p2p file sharing system implemented in structured p2p file system. It forms a cluster based on node proximity as well as groups the nodes which having common interest into sub-cluster. A narrative lookup function named as DHT and file replication algorithm which supports resourceful file lookup and access. To diminish overhead and file searching delay it keeps up file information collection. Bloom filter technique is used to cut file sharing delay. Finally proposed approach shows competence in file search, sharing and overhead